A type assignment system for game semantics
نویسندگان
چکیده
We present a type assignment system that provides a finitary interpretation of lambda terms in a game semantics model. Traditionally, type assignment systems describe the semantic interpretation of terms in domain theoretic models. Quite surprisingly, the type assignment system presented in this paper is very similar to the traditional ones, the main difference being the omission of the subtyping rules.
منابع مشابه
A Type Assignment System for the Game Semantics
The aim of this paper is to give an alternative description of the game semantics (). The main idea is to mimic, in the game semantics setting, a duality existing in domain theory. In domain theory, the denotational semantics of a language can be given in two forms: a term can be interpreted by some point in a particular domain, or by a set of properties. The Stone-duality theorems, for domain ...
متن کاملInnocent Game Semantics via Intersection Type Assignment Systems
The aim of this work is to correlate two different approaches to the semantics of programming languages: game semantics and intersection type assignment systems (ITAS). Namely, we present an ITAS that provides the description of the semantic interpretation of a typed lambda calculus in a game model based on innocent strategies. Compared to the traditional ITAS used to describe the semantic inte...
متن کاملA Sound, Complete and Effective Second Order Game Semantics
We define a game semantics for second order classical arithmetic PA 2 (with quantification over predicates on integers and full comprehension axiom). Our semantics is effective: moves are described by a finite amount of information and whenever there is some winning strategy for the player defending the truth of the formula, then there is some primitive recursive winning strategy. Then we show ...
متن کاملA short note on type-inhabitation: Formula-trees vs. game semantics
This short note compares two different methods for exploring type-inhabitation in the simply typed lambda-calculus, highlighting their similarities.
متن کاملEstimation of the Length of Interactions in Arena Game Semantics
We estimate the maximal length of interactions between strategies in HO/N game semantics, in the spirit of the work by Schwichtenberg and Beckmann for the length of reduction in simply typed λ-calculus. Because of the operational content of game semantics, the bounds presented here also apply to head linear reduction on λ-terms and to the execution of programs by abstract machines (PAM/KAM), in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 398 شماره
صفحات -
تاریخ انتشار 2008